On the e ciency of adaptive MCMC algorithms
نویسندگان
چکیده
Abstract We study a class of adaptive Markov Chain Monte Carlo (MCMC) processes which aim at behaving as an optimal target process via a learning procedure. We show, under appropriate conditions, that the adaptive process and the optimal (nonadaptive) MCMC process share identical asymptotic properties. The special case of adaptive MCMC algorithms governed by stochastic approximation is considered in details and we apply our results to the adaptive Metropolis algorithm of Haario et al. (2001). We also propose a new class of adaptive MCMC algorithms, called quasi-perfect adaptive MCMC which possesses appealing theoretical and practical properties, as demonstrated through numerical simulations.
منابع مشابه
System identification using evolutionary Markov chain Monte Carlo
System identi®cation involves determination of the functional structure of a target system that underlies the observed data. In this paper, we present a probabilistic evolutionary method that optimizes system architectures for the iden-ti®cation of unknown target systems. The method is distinguished from existing evolutionary algorithms (EAs) in that the individuals are generated from a probabi...
متن کاملA tutorial on adaptive MCMC
We review adaptive Markov chain Monte Carlo algorithms (MCMC) as a mean to optimise their performance. Using simple toy examples we review their theoretical underpinnings, and in particular show why adaptive MCMC algorithms might fail when some fundamental properties are not satisfied. This leads to guidelines concerning the design of correct algorithms. We then review criteria and the useful f...
متن کاملOptimal Proposal Distributions and Adaptive MCMC by Jeffrey
We review recent work concerning optimal proposal scalings for Metropolis-Hastings MCMC algorithms, and adaptive MCMC algorithms for trying to improve the algorithm on the fly.
متن کاملOptimal Proposal Distributions and Adaptive MCMC
We review recent work concerning optimal proposal scalings for Metropolis-Hastings MCMC algorithms, and adaptive MCMC algorithms for trying to improve the algorithm on the fly.
متن کاملMarkov Chain Monte Carlo Algorithms: Theory and Practice
We describe the importance and widespread use of Markov chain Monte Carlo (MCMC) algorithms, with an emphasis on the roles in which theoretical analysis can help with their practical implementation. In particular, we discuss how to achieve rigorous quantitative bounds on convergence to stationarity using the coupling method together with drift and minorisation conditions. We also discuss recent...
متن کامل